InforLorV4, Main, Exploration, bibRecord, 007B39

Unions of non-disjoint theories and combinations of satisfiability procedures

Identifieur interne : 007B39 ( Main/Exploration ); précédent : 007B38; suivant : 007B40

Unions of non-disjoint theories and combinations of satisfiability procedures

Auteurs : Cesare Tinelli [États-Unis] ; Christophe Ringeissen [France]

Source :

Theoretical computer science [ 0304-3975 ] ; 2003.

RBID : Pascal:03-0108985

Descripteurs français

Pascal (Inist)
- Théorie décision, Satisfaisabilité, Raisonnement, Déduction, Consistance, Validité, Décidabilité, Algèbre universelle, Théorie équationnelle, Langage, Théorie langage, Composante, Complet, Résultat, Condition, Théorie contrainte, Procédure, Décision, Contrainte, Méthode, Nombre, Indice conditionnement, Modèle, Logique sous contrainte, Procedure combinaison, Procédure Nelson Oppen.
Wicri :
- topic : Langage, Décision.
mix :
- automated deduction, combinaison de procédures de satisfaisabilité, constraint-based reasoning, decision problems, déduction automatique, procédures de décision, raisonnement avec contraintes.

English descriptors

KwdEn :
- Combination procedure, Complete, Component, Condition, Condition number, Consistency, Constrained logic, Constraint, Constraint theory, Decidability, Decision, Decision theory, Deduction, Equational theory, Language, Language theory, Method, Models, Nelson Oppen procedure, Number, Procedure, Reasoning, Result, Satisfiability, Universal algebra, Validity.

Abstract

In this paper we outline a theoretical framework for the combination of decision procedures for constraint satisfiability. We describe a general combination method which, given a procedure that decides constraint satisfiability with respect to a constraint theory T₁ and one that decides constraint satisfiability with respect to a constraint theory T₂, produces a procedure that (semi-)decides constraint satisfiability with respect to the union of T₁ and T₂. We provide a number of model-theoretic conditions on the constraint language and the component constraint theories for the method to be sound and complete, with special emphasis on the case in which the signatures of the component theories are non-disjoint. We also describe some general classes of theories to which our combination results apply, and relate our approach to some of the existing combination methods in the field.

Url:

https://hal.inria.fr/inria-00099668

Affiliations:

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Unions of non-disjoint theories and combinations of satisfiability procedures</title>
<author><name sortKey="Tinelli, Cesare" sort="Tinelli, Cesare" uniqKey="Tinelli C" first="Cesare" last="Tinelli">Cesare Tinelli</name>
<affiliation wicri:level="4"><inist:fA14 i1="01"><s1>Department of Computer Science, University of Iowa</s1>
<s2>Iowa City, IA 52242</s2>
<s3>USA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>États-Unis</country>
<placeName><settlement type="city">Iowa City</settlement>
<region type="state">Iowa</region>
</placeName>
<orgName type="university">Université de l'Iowa</orgName>
</affiliation>
</author>
<author><name sortKey="Ringeissen, Christophe" sort="Ringeissen, Christophe" uniqKey="Ringeissen C" first="Christophe" last="Ringeissen">Christophe Ringeissen</name>
<affiliation wicri:level="3"><inist:fA14 i1="02"><s1>INRIA Lorraine and LORIA-CNRS, BP 101</s1>
<s2>54602 Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
<settlement type="city">Villers-lès-Nancy</settlement>
</placeName>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">03-0108985</idno>
<date when="2003">2003</date>
<idno type="stanalyst">PASCAL 03-0108985 INIST</idno>
<idno type="RBID">Pascal:03-0108985</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000826</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000217</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">000663</idno>
<idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000663</idno>
<idno type="wicri:doubleKey">0304-3975:2003:Tinelli C:unions:of:non</idno>
<idno type="wicri:Area/Main/Merge">007F22</idno>
<idno type="wicri:source">HAL</idno>
<idno type="RBID">Hal:inria-00099668</idno>
<idno type="url">https://hal.inria.fr/inria-00099668</idno>
<idno type="wicri:Area/Hal/Corpus">005067</idno>
<idno type="wicri:Area/Hal/Curation">005067</idno>
<idno type="wicri:Area/Hal/Checkpoint">005326</idno>
<idno type="wicri:explorRef" wicri:stream="Hal" wicri:step="Checkpoint">005326</idno>
<idno type="wicri:doubleKey">0304-3975:2003:Tinelli C:unions:of:non</idno>
<idno type="wicri:Area/Main/Merge">008163</idno>
<idno type="wicri:Area/Main/Curation">007B39</idno>
<idno type="wicri:Area/Main/Exploration">007B39</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Unions of non-disjoint theories and combinations of satisfiability procedures</title>
<author><name sortKey="Tinelli, Cesare" sort="Tinelli, Cesare" uniqKey="Tinelli C" first="Cesare" last="Tinelli">Cesare Tinelli</name>
<affiliation wicri:level="4"><inist:fA14 i1="01"><s1>Department of Computer Science, University of Iowa</s1>
<s2>Iowa City, IA 52242</s2>
<s3>USA</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>États-Unis</country>
<placeName><settlement type="city">Iowa City</settlement>
<region type="state">Iowa</region>
</placeName>
<orgName type="university">Université de l'Iowa</orgName>
</affiliation>
</author>
<author><name sortKey="Ringeissen, Christophe" sort="Ringeissen, Christophe" uniqKey="Ringeissen C" first="Christophe" last="Ringeissen">Christophe Ringeissen</name>
<affiliation wicri:level="3"><inist:fA14 i1="02"><s1>INRIA Lorraine and LORIA-CNRS, BP 101</s1>
<s2>54602 Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>France</country>
<placeName><region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
<settlement type="city">Villers-lès-Nancy</settlement>
</placeName>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Theoretical computer science</title>
<title level="j" type="abbreviated">Theor. comput. sci.</title>
<idno type="ISSN">0304-3975</idno>
<imprint><date when="2003">2003</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Theoretical computer science</title>
<title level="j" type="abbreviated">Theor. comput. sci.</title>
<idno type="ISSN">0304-3975</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Combination procedure</term>
<term>Complete</term>
<term>Component</term>
<term>Condition</term>
<term>Condition number</term>
<term>Consistency</term>
<term>Constrained logic</term>
<term>Constraint</term>
<term>Constraint theory</term>
<term>Decidability</term>
<term>Decision</term>
<term>Decision theory</term>
<term>Deduction</term>
<term>Equational theory</term>
<term>Language</term>
<term>Language theory</term>
<term>Method</term>
<term>Models</term>
<term>Nelson Oppen procedure</term>
<term>Number</term>
<term>Procedure</term>
<term>Reasoning</term>
<term>Result</term>
<term>Satisfiability</term>
<term>Universal algebra</term>
<term>Validity</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Théorie décision</term>
<term>Satisfaisabilité</term>
<term>Raisonnement</term>
<term>Déduction</term>
<term>Consistance</term>
<term>Validité</term>
<term>Décidabilité</term>
<term>Algèbre universelle</term>
<term>Théorie équationnelle</term>
<term>Langage</term>
<term>Théorie langage</term>
<term>Composante</term>
<term>Complet</term>
<term>Résultat</term>
<term>Condition</term>
<term>Théorie contrainte</term>
<term>Procédure</term>
<term>Décision</term>
<term>Contrainte</term>
<term>Méthode</term>
<term>Nombre</term>
<term>Indice conditionnement</term>
<term>Modèle</term>
<term>Logique sous contrainte</term>
<term>Procedure combinaison</term>
<term>Procédure Nelson Oppen</term>
</keywords>
<keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Langage</term>
<term>Décision</term>
</keywords>
<keywords scheme="mix" xml:lang="fr"><term>automated deduction</term>
<term>combinaison de procédures de satisfaisabilité</term>
<term>constraint-based reasoning</term>
<term>decision problems</term>
<term>déduction automatique</term>
<term>procédures de décision</term>
<term>raisonnement avec contraintes</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">In this paper we outline a theoretical framework for the combination of decision procedures for constraint satisfiability. We describe a general combination method which, given a procedure that decides constraint satisfiability with respect to a constraint theory T<sub>1</sub>
 and one that decides constraint satisfiability with respect to a constraint theory T<sub>2</sub>
, produces a procedure that (semi-)decides constraint satisfiability with respect to the union of T<sub>1</sub>
 and T<sub>2</sub>
. We provide a number of model-theoretic conditions on the constraint language and the component constraint theories for the method to be sound and complete, with special emphasis on the case in which the signatures of the component theories are non-disjoint. We also describe some general classes of theories to which our combination results apply, and relate our approach to some of the existing combination methods in the field.</div>
</front>
</TEI>
<affiliations><list><country><li>France</li>
<li>États-Unis</li>
</country>
<region><li>Grand Est</li>
<li>Iowa</li>
<li>Lorraine (région)</li>
</region>
<settlement><li>Iowa City</li>
<li>Villers-lès-Nancy</li>
</settlement>
<orgName><li>Université de l'Iowa</li>
</orgName>
</list>
<tree><country name="États-Unis"><region name="Iowa"><name sortKey="Tinelli, Cesare" sort="Tinelli, Cesare" uniqKey="Tinelli C" first="Cesare" last="Tinelli">Cesare Tinelli</name>
</region>
</country>
<country name="France"><region name="Grand Est"><name sortKey="Ringeissen, Christophe" sort="Ringeissen, Christophe" uniqKey="Ringeissen C" first="Christophe" last="Ringeissen">Christophe Ringeissen</name>
</region>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 007B39 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 007B39 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Main
   |étape=   Exploration
   |type=    RBID
   |clé=     Pascal:03-0108985
   |texte=   Unions of non-disjoint theories and combinations of satisfiability procedures
}}

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022

Serveur d'exploration sur la recherche en informatique en Lorraine

Unions of non-disjoint theories and combinations of satisfiability procedures

Unions of non-disjoint theories and combinations of satisfiability procedures

Source :

Descripteurs français

English descriptors

Abstract

Links toward previous steps (curation, corpus...)

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.